منابع مشابه
Trainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملCandy Crush is NP-hard
We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
متن کاملProtein design is NP-hard.
Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context of this observation, to provide a simple i...
متن کاملDiploid Alignment is NP-hard
Human genomes consist of pairs of homologous chromosomes, one of which is inherited from the mother and the other from the father. Species, such as human, with pairs of homologous chromosomes are called diploid. Sequence analysis literature is, however, almost solely built under the model of a single haplotype sequence representing a species. This fundamental choice is apparently due to the hug...
متن کاملInflating Balls is NP-Hard
A collection C of balls in R is δ-inflatable if it is isometric to the intersection U ∩ E of some d-dimensional affine subspace E with a collection U of (d + δ)-dimensional balls that are disjoint and have equal radius. We give a quadratic-time algorithm to recognize 1-inflatable collections of balls in any fixed dimension, and show that recognizing δ-inflatable collections of d-dimensional bal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.09.039